A generalized projection pursuit procedure and its significance level
نویسندگان
چکیده
منابع مشابه
Generalized projection pursuit regression
Projection pursuit regression (PPR) can be used to estimate a smooth function of several variables from noisy and scattered data. The estimate is a sum of smoothed one-dimensional projections of the variables. This paper discusses an extension of PPR to exponential family distributions, called generalized projection pursuit regression (GPPR). The proposed model allows multiple responses and non...
متن کاملA Note on Projection Pursuit
I provide a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and point out an important difference between the two. In doing so, I correct a small error in the original exploratory projection pursuit paper (Friedman 1987). The implication of the difference is briefly discussed in the context of an application in which projection pur...
متن کاملFunctional Projection Pursuit
This article describes the adaption of exploratory projection pursuit for use with functional data. The aim is to nd \interesting" projections of functional data: e.g. to separate curves into meaningful clusters. Functional data are projected onto low-dimensional subspaces determined by a projection function using a suitable inner product. Such a projection is rapidly computed by representing d...
متن کاملOblique Projection Matching Pursuit
Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is...
متن کاملLocalized Exploratory Projection Pursuit
Based on CART, we introduce a recursive partitioning method for high dimensional space which partitions the data using low dimensional features. The low dimensional features are extracted via an exploratory projection pursuit (EPP) method, localized to each node in the tree. In addition, we present an exploratory splitting rule that is potentially less biased to the training data. This leads to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hiroshima Mathematical Journal
سال: 1997
ISSN: 0018-2079
DOI: 10.32917/hmj/1206126967